Graphsj 3: a Modern Didactic Application for Graph Algorithms
نویسندگان
چکیده
In 2009 the authors developed an open source Java application and framework, GraphsJ, to help the students in their approach to the study of graph algorithms, by guiding them to understand their logical structures through experiments on numerical instances. After four years, the availability of Java 7 and of new tools suggested the implementation of a new major release. We present a new major release, GraphsJ 3, whose implementation in Java 7 maintains the main characteristics of a useful educational application: Portability, extensibility, ease of use and availability as open source software. The new release provides a redesigned architecture, implemented through cutting-edge languages and technologies and a robust Mavenbased build. The presented Java framework constitutes a further step towards the implementation of didactic instruments for the teaching of graph theory. Future developments will include extensions to ease the automatic addition of new algorithms.
منابع مشابه
Application Mapping onto Network-on-Chip using Bypass Channel
Increasing the number of cores integrated on a chip and the problems of system on chips caused to emerge networks on chips. NoCs have features such as scalability and high performance. NoCs architecture provides communication infrastructure and in this way, the blocks were produced that their communication with each other made NoC. Due to increasing number of cores, the placement of the cores i...
متن کاملOPTIMALIZATION PHASE USING GRAPH MODELLING FOR RELIABLE BUILDING COMPLEXES
During the planning phase of modern, complex, block-structured, large-area located, but still landscape-harmonized health-care buildings, the key is the optimal positioning of the blocks and functions, simultaneously ensuring the most-effective backup-paths for any transportation route failure in the buildings in order to speed up system operation, reduce maintenance costs and especially to imp...
متن کاملDeveloping Heuristics for the Graph Coloring Problem Applied to Register Allocation in Embedded Systems
The main aim of this paper consists in developing an effective e-learning tool, focused on evolutionary algorithms, in order to solve the graph coloring problem. Subsidiary, we apply graph coloring for register allocation in embedded systems. From didactic viewpoint, our tool has benefits in the learning process because it helps students to observe the relationship between the graph coloring pr...
متن کاملThe Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs G1(V, E1), G2(V, E2), the Homogeneous Set Sandwich Problem (HSSP) asks whether there exists a sandwich graph GS(V, ES), E1 ⊆ ES ⊆ E2, which has a homogeneous set. In 2001, Tang et al. [15]...
متن کاملAn Introduction to Inference and Learning in Bayesian Networks
Bayesian networks (BNs) are modern tools for modeling phenomena in dynamic and static systems and are used in different subjects such as disease diagnosis, weather forecasting, decision making and clustering. A BN is a graphical-probabilistic model which represents causal relations among random variables and consists of a directed acyclic graph and a set of conditional probabilities. Structure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JCS
دوره 10 شماره
صفحات -
تاریخ انتشار 2014